منابع مشابه
Averaged gene expressions for regression.
Although averaging is a simple technique, it plays an important role in reducing variance. We use this essential property of averaging in regression of the DNA microarray data, which poses the challenge of having far more features than samples. In this paper, we introduce a two-step procedure that combines (1) hierarchical clustering and (2) Lasso. By averaging the genes within the clusters obt...
متن کاملCompact expressions for spherically averaged position and momentum densities.
Compact expressions for spherically averaged position and momentum density integrals are given in terms of spherical Bessel functions (j(n)) and modified spherical Bessel functions (i(n)), respectively. All integrals required for ab initio calculations involving s, p, d, and f-type Gaussian functions are tabulated, highlighting a neat isomorphism between position and momentum space formulae. Sp...
متن کاملAsymptotically Optimal Smoothing of Averaged Lms for Regression Parameter Tracking
The sequence of estimates formed by the LMS algorithm for a standard linear regression estimation problem is considered. In this paper it is first shown that smoothing the LMS estimates using a matrix updating will lead to smoothed estimates with optimal tracking properties, also in the case the true parameters are slowly changing as a random walk. The choice of smoothing matrix should be tailo...
متن کاملIdentification with Averaged Data and Implications for Hedonic Regression Studies
In the estimation of models with averaged data, weighted least squares is often used and recommended as a way of improving the e¢ciency of the estimator. However, if the size of the di¤erent groups is not conditionally independent of the regressand, consistent estimation may not be possible at all. It is argued that in the case of some leading examples of averaged data regression, consistent es...
متن کاملADAPTIVITY OF AVERAGED STOCHASTIC GRADIENT DESCENT Adaptivity of averaged stochastic gradient descent to local strong convexity for logistic regression
In this paper, we consider supervised learning problems such as logistic regression and study the stochastic gradient method with averaging, in the usual stochastic approximation setting where observations are used only once. We show that after N iterations, with a constant step-size proportional to 1/R √ N where N is the number of observations and R is the maximum norm of the observations, the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Biostatistics
سال: 2006
ISSN: 1465-4644,1468-4357
DOI: 10.1093/biostatistics/kxl002